On Skolemization in constructive theories

نویسندگان

  • Matthias Baaz
  • Rosalie Iemhoff
چکیده

In this paper a method for the replacement, in formulas, of strong quantifiers by functions is introduced that can be considered as an alternative to Skolemization in the setting of constructive theories. A constructive extension of intuitionistic predicate logic that captures the notions of preorder and existence is introduced and the method, orderization, is shown to be sound and complete with respect to this logic. This implies an analogue of Herbrand’s theorem for intuitionistic logic. The orderization method is applied to the constructive theories of equality and groups.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The eskolemization of universal quantifiers

This paper is a sequel to the papers [4, 6] in which an alternative skolemization method called ekolemization was introduced that, when applied to the strong existential quantifiers in a formula, is sound and complete for constructive theories. Based on that method an analogue of Herbrand’s theorem was proved to hold as well. In this paper we extend the method to universal quantifiers and show ...

متن کامل

Skolemization for Weighted First-Order Model Counting

First-order model counting emerged recently as a novel reasoning task, at the core of efficient algorithms for probabilistic logics. We present a Skolemization algorithm for model counting problems that eliminates existential quantifiers from a first-order logic theory without changing its weighted model count. For certain subsets of first-order logic, lifted model counters were shown to run in...

متن کامل

Skolemization Modulo Theories

Combining classical automated theorem proving techniques with theory based reasoning, such as satisfiability modulo theories, is a new approach to first-order reasoning modulo theories. Skolemization is a classical technique used to transform first-order formulas into equisatisfiable form. We show how Skolemization can benefit from a new satisfiability modulo theories based simplification techn...

متن کامل

Application of Learning Theories in Clinical Education

Introduction: The purpose of education is learning. Several theories have been raised about learning, which have tried to explain how learning occurs. They help teachers to choose teaching methods, prepare learning environment and determine students' activities. Given the importance of learning theories in education, this study aimed to review application of learning theories in nursing educati...

متن کامل

Lifted Inference for Probabilistic Logic Programs

First-order model counting emerged recently as a novel reasoning task, at the core of efficient algorithms for probabilistic logics such as MLNs. For certain subsets of first-order logic, lifted model counters were shown to run in time polynomial in the number of objects in the domain of discourse, where propositional model counters require exponential time. However, these guarantees apply only...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Symb. Log.

دوره 73  شماره 

صفحات  -

تاریخ انتشار 2008